A Note on Applicability of the Incompleteness Theorem to Human Mind
نویسنده
چکیده
We shall present some relations between consistency and reeection principles which explain why is GG odel's incompleteness theorem wrongly used to argue that thinking machines are impossible.
منابع مشابه
A Note on the Strong Law of Large Numbers
Petrov (1996) proved the connection between general moment conditions and the applicability of the strong law of large numbers to a sequence of pairwise independent and identically distributed random variables. This note examines this connection to a sequence of pairwise negative quadrant dependent (NQD) and identically distributed random variables. As a consequence of the main theorem ...
متن کاملOn Godel's incompleteness theorem(s), Artificial Intelligence/Life, and Human Mind
In the present paper we have discussed concerning Godel’s incompleteness theorem(s) and plausible implications to artificial intelligence/life and human mind. Perhaps we should agree with Sullins III, that the value of this finding is not to discourage certain types of research in AL, but rather to help move us in a direction where we can more clearly define the results of that research. Godel’...
متن کاملA Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei
In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...
متن کاملA note on spectral mapping theorem
This paper aims to present the well-known spectral mapping theorem for multi-variable functions.
متن کاملGödel incompleteness theorems and the limits of their applicability. I
This is a survey of results related to the Gödel incompleteness theorems and the limits of their applicability. The first part of the paper discusses Gödel’s own formulations along with modern strengthenings of the first incompleteness theorem. Various forms and proofs of this theorem are compared. Incompleteness results related to algorithmic problems and mathematically natural examples of unp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 96 شماره
صفحات -
تاریخ انتشار 1999